Railway Engine Assignment Models Based on Combinatorial and Integer Programming
نویسندگان
چکیده
This paper presents an experimental study for the Hungarian State Railway Company (MÁV). The engine assignment problem was solved at MÁV by their experts without using any explicit operations research tool. Furthermore, the operations research model was not known at the company. The goal of our project was to introduce and solve operations research model for the engine assignment problem on real data set. For the engine assignment problem we are using a combinatorial optimization model. At this stage of research the single type train that is pulled by a single type engine is modeled and solved for real data. There are two regions in Hungary where the methodology described in this paper can be used and MÁV started to use it regularly. There is a need to generalize the model for multiple type trains and multiple type engines.
منابع مشابه
یافتن راهحلهای مؤثر در مسائل بهینهسازی ترکیبی چندهدفه به کمک روش قیود ارتجاعی
In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is...
متن کاملCombinatorial Optimization Model for Railway Engine Assignment Problem
This paper presents an experimental study for the Hungarian State Railway Company (MÁV). The engine assignment problem was solved at MÁV by their experts without using any explicit operations research tool. Furthermore, the operations research model was not known at the company. The goal of our project was to introduce and solve an operations research model for the engine assignment problem on ...
متن کاملA Fast Heuristic Algorithm for the Train Unit Assignment Problem
In this paper we study a railway optimization problem known as the Train Unit Assignment Problem. A train unit consists of a self-contained train with an engine and a set of wagons with passenger seats. Given a set of timetabled train trips, each with a required number of passenger seats, and a set of train units, each with a given number of available seats, the problem calls for the best assig...
متن کامل12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
In this paper we study a railway optimization problem known as the Train Unit Assignment Problem. A train unit consists of a self-contained train with an engine and a set of wagons with passenger seats. Given a set of timetabled train trips, each with a required number of passenger seats, and a set of train units, each with a given number of available seats, the problem calls for the best assig...
متن کاملA Binary Quadratic Programming Approach to Vehicle Positioning
The Vehicle Positioning Problem (VPP) is a classical combinatorial optimization problem that has a natural formulation as a Mixed Integer Quadratically Constrained Program. This MIQCP is closely related to the Quadratic Assignment Problem and, as far as we know, has not received any attention yet. We show in this article that such a formulation has interesting theoretical properties. Its QP rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006